Optimal evasive strategies for multiple interacting agents with motion constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal evasive strategies for groups of interacting agents with motion constraints

In this thesis we examine systems of pursuit and evasion with multiple evaders from several perspectives. Through the analysis of mathematical models and the study of field experiments we seek to understand how constraints on individual motion and sensing abilities affect outcomes on the level of the group and the individual. We present a nonlinear model of pursuit and evasion on the plane for ...

متن کامل

Decentralized Motion Control of Multiple Holonomic Agents under Input Constraints

The navigation function methodology, established in previous work for centralized multiple robot navigation, is extended for decentralized navigation with input constraints. In contrast to the centralized case, each agent plans its actions without knowing the destinations of the other agents. Asymptotic stability is guaranteed by the existence of a global Lyapunov function for the whole system,...

متن کامل

Optimal recruitment strategies for groups of interacting walkers with leaders.

We introduce a model of interacting random walkers on a finite one-dimensional chain with absorbing boundaries or targets at the ends. Walkers are of two types: informed particles that move ballistically towards a given target and diffusing uninformed particles that are biased towards close informed individuals. This model mimics the dynamics of hierarchical groups of animals, where an informed...

متن کامل

Optimal Control with Fuzzy Chance Constraints

In this paper, a model of an optimal control problem with chance constraints is introduced. The parametersof the constraints are fuzzy, random or fuzzy random variables. Todefuzzify the constraints, we consider possibility levels.  Bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...

متن کامل

Optimal Negotiation Strategies for Agents with Incomplete Information

This paper analyzes the process of automated negotiation between two competitive agents that have firm deadlines and incomplete information about their opponent. Generally speaking, the outcome of a negotiation depends on many parameters—including the agents’ preferences, their reservation limits, their attitude toward time and the strategies they use. Although in most realistic situations it i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2018

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2018.04.008